A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
نویسندگان
چکیده
منابع مشابه
Solving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties
Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...
متن کاملMemeticAlgorithmand Genetic Algorithm for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Costs
The Single Machine Scheduling (SMS) problem with Multiple Objective Function (MOF) is one of the most representative problems in the scheduling area. In this paper, we consider the SMS problem with linear earliness and quadratic tardiness costs, and no machine idle time. The chosen method is based on memetic algorithm and genetic algorithm. For this purpose, Genetic Algorithms (GA) are a popula...
متن کاملAn Adaptive Genetic Algorithm to the Single Machine Scheduling Problem with Earliness and Tardiness Penalties
This paper deals with the SingleMachine Scheduling Problem with Earliness and Tardiness Penalties, considering distinct due windows and sequence-dependent setup time. Due to its complexity, an adaptive genetic algorithm is proposed for solving it. Many search operators are used to explore the solution space where the choice probability for each operator depends on the success in a previous sear...
متن کاملA branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
This paper considers the problem of scheduling a single machine, in which the objective function is to minimize the weighted quadratic earliness and tardiness penalties and no machine idle time is allowed. We develop a branch and bound algorithm involving the implementation of lower and upper bounding procedures as well as some dominance rules. The lower bound is designed based on a lagrangian ...
متن کاملHeuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies involved in the construction of the greedy randomized schedules. On the other hand, these versions also differ on whether they employ only a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2009
ISSN: 0305-0548
DOI: 10.1016/j.cor.2008.11.016